Parameter Estimation of Binomial Distribution through Nce Graph Grammar
نویسنده
چکیده
ABSTRACT In this paper we define edNCE random graph grammar and also generate the language for folded cube. Our purpose is to deal with the parameter and hypothesis testing on the equality of two binomial distribution population with missing data in language from edNCE random graph grammar. In addition consistency and its limiting distribution are obtained. KEYWORDS— Graph grammar, missing data, maximum likelihood estimation, hypothesis testing, Boundary.
منابع مشابه
Estimation of parameter of proportion in Binomial Distribution Using Adjusted Prior Distribution
Historically, various methods were suggested for the estimation of Bernoulli and Binomial distributions parameter. One of the suggested methods is the Bayesian method, which is based on employing prior distribution. Their sound selection on parameter space play a crucial role in reducing posterior Bayesian estimator error. At times, large scale of the parametric changes on parameter space bring...
متن کاملMinimax Estimator of a Lower Bounded Parameter of a Discrete Distribution under a Squared Log Error Loss Function
The problem of estimating the parameter ?, when it is restricted to an interval of the form , in a class of discrete distributions, including Binomial Negative Binomial discrete Weibull and etc., is considered. We give necessary and sufficient conditions for which the Bayes estimator of with respect to a two points boundary supported prior is minimax under squared log error loss function....
متن کاملEstimating the Dispersion Parameter of the Negative Binomial Distribution for Analyzing Crash Data Using a Bootstrapped Maximum Likelihood Method
The objective of this study is to improve the estimation of the dispersion parameter of the negative binomial distribution for modeling motor vehicle collisions. The negative binomial distribution is widely used to model count data such as traffic crash data, which often exhibit low sample mean values and small sample sizes. Under such situations, the most commonly used methods for estimating t...
متن کاملThe Bounded Tree-Width Problem of Context-Free Graph Languages
We show that the following (equivalent) problems are P-complete: 1. Does a given connuent NCE graph grammar only generate graphs of bounded tree-width? and 2. is the graph language generated by a given connuent NCE graph grammar an HR language? This settles the complexity of these important problems on graph grammars .
متن کاملSyntactic Processing of Diagrams by Graph Grammars
We deal with syntactic definitions and processing of program diagrams based on graph grammars with respect to the mechanical drawing. We propose an attribute NCE graph grammar of hierarchical diagrams such as structured program diagrams. We also propose attribute context-free and context-sensitive NCE graph grammars for nested and tessellation diagrams, respectively. Attribute rules are used fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016